Hypermap operations of finite order
نویسندگان
چکیده
Duality and chirality are examples of operations of order 2 on hypermaps. James showed that the groups of all operations on hypermaps and on oriented hypermaps can be identified with the outer automorphism groups Out∆ ∼= PGL2(Z) and Out∆ ∼= GL2(Z) of the groups ∆ = C2 ∗ C2 ∗ C2 and ∆ + = F2. We will consider the elements of finite order in these two groups, and the operations they induce. MSC classification: Primary 05C10, secondary 05C25, 20F28.
منابع مشابه
Algebraic Hypermap Morphisms
Algebraic hypermaps combinatorially describe topological hypermaps, that is, embeddings of hypergraphs on compact orientable surfaces. It turns out that algebraic hypermaps enjoy several properties of Riemann surfaces. For instance, each algebraic hypermap has its genus, and the analogue of Riemann–Hurwitz formula for Riemann surfaces was proved to hold for a quotient hypermap with respect to a...
متن کاملDuality Index of Oriented Regular Hypermaps
By adapting the notion of chirality group, the duality group of H can be defined as the the minimal subgroup D(H) E Mon(H) such that H/D(H) is a self-dual hypermap (a hypermap isomorphic to its dual). Here, we prove that for any positive integer d, we can find a hypermap of that duality index (the order of D(H)), even when some restrictions apply, and also that, for any positive integer k, we c...
متن کاملHypermap Rewriting: A Combinatorial Approach
Sopena, E., Hypermap rewriting: a combinatorial approach, Theoretical Computer Science 85 (1991) 253-281. Combinatorial hypermaps may be viewed as topological representations of hypergraphs. In this paper, we introduce a hypermap rewriting model based on a purely combinatorial formulation of the rewriting mechanism. We illustrate this model by providing a hypermap grammar which generates the se...
متن کاملHypermap in the Digital Earth
This paper addresses the issues on hypermap development and management in the Digital Earth. The integration of remote sensing and hypermap is presented. Finally, The future development of hypermap is discussed.
متن کاملFormal Study of Plane Delaunay Triangulation
This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe triangulations, we rely on a combinatorial hypermap specification framework we have been developing for years. We embed hypermaps in the plane by attaching coor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010